Analysis of Infeasible Cases in Optimal Power Flow Problem
نویسندگان
چکیده
منابع مشابه
analysis of power in the network society
اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...
15 صفحه اولA Computational Analysis of the Optimal Power Flow Problem
The optimal power flow problem is concerned with finding a proper operating point for a power network while attempting to minimize some cost function and satisfy several network constraints. In this report we analyze the optimal power flow problem subject to contingency constraints, which demands that there be enough power to meet demands in the network in the event of contingencies such as a f...
متن کاملImprovement of DC Optimal Power Flow Problem Based on Nodal Approximation of Transmission Losses
This paper presents a method to improve the accuracy of DC Optimal Power Flow problem, based on evaluating some nodal shares of transmission losses, and illustrates its efficiency through comparing with the conventional DCOPF solution, as well as the full AC one. This method provides three main advantages, confirming its efficiency: 1- It results in such generation levels, line flows, and noda...
متن کاملHydrothermal Optimal Power Flow Using Continuation Method
The problem of optimal economic operation of hydrothermal electric power systems is solved using powerful continuation method. While in conventional approach, fixed generation voltages are used to avoid convergence problems, in the proposed algorithm, they are treated as variables so that better solutions can be obtained. The algorithm is tested for a typical 5-bus and 17-bus New Zealand networ...
متن کاملThe Minimum Universal Cost Flow in an Infeasible Flow Network
In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2016
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2016.10.694